A Composition Theorem for Randomized Query Complexity
نویسندگان
چکیده
Let the randomized query complexity of a relation for error probability ǫ be denoted by Rǫ(·). We prove that for any relation f ⊆ {0, 1} × R and Boolean function g : {0, 1} → {0, 1}, R1/3(f ◦g ) = Ω(R4/9(f) ·R1/2−1/n4(g)), where f ◦g n is the relation obtained by composing f and g. We also show that R1/3 (
منابع مشابه
Randomized Query Complexity of Sabotaged and Composed Functions
We study the composition question for bounded-error randomized query complexity: Is R(f ◦ g) = Ω(R(f)R(g)) for all Boolean functions f and g? We show that inserting a simple Boolean function h, whose query complexity is only Θ(logR(g)), in between f and g allows us to prove R(f ◦ h ◦ g) = Ω(R(f)R(h)R(g)). We prove this using a new lower bound measure for randomized query complexity we call rand...
متن کاملA Composition Theorem via Conflict Complexity
Let R(·) stand for the bounded-error randomized query complexity. We show that for any relation f ⊆ {0, 1}×S and partial Boolean function g ⊆ {0, 1}×{0, 1}, R1/3(f ◦g ) = Ω(R4/9(f)·
متن کاملComposition and Simulation Theorems via Pseudo-random Properties
We prove a randomized communication-complexity lower bound for a composed function — OrderedSearch ◦ IP — by lifting the randomized query-complexity lower-bound of OrderedSearch to the communication-complexity setting. We do this by extending ideas from a paper of Raz and Wigderson [RW89]. We think that the techniques we develop will be useful in proving a randomized simulation theorem. We also...
متن کاملA ZPP Lifting Theorem
The complexity class ZPP (corresponding to zero-error randomized algorithms with access to one NP oracle query) is known to have a number of curious properties. We further explore this class in the settings of time complexity, query complexity, and communication complexity. r For starters, we provide a new characterization: ZPP equals the restriction of BPP where the algorithm is only allowed t...
متن کاملLifting randomized query complexity to randomized communication complexity
We show that for any (partial) query function f : {0, 1} → {0, 1}, the randomized communication complexity of f composed with Indexm (with m = poly(n)) is at least the randomized query complexity of f times log n. Here Indexm : [m] × {0, 1} → {0, 1} is defined as Indexm(x, y) = yx (the xth bit of y). Our proof follows on the lines of Raz and Mckenzie [RM99] (and its generalization due to [GPW15...
متن کامل